The Parity Problem for Irreducible Cubic Forms
نویسنده
چکیده
This conjecture can be traced to Chowla ([1], p. 96). It is closely related to the Bunyakovsky– Schinzel conjecture on primes represented by irreducible polynomials. The one-variable analogue of (1.1) is classical for deg f = 1 and quite hopeless for deg f > 1. We know (1.1) itself when deg f ≤ 2. (The main ideas of the proof go back to de la Vallée-Poussin ([3], [4]); see [11], §3.3, for an exposition.) The problem of proving (1.1) when deg f ≥ 3 has remained open until now: sieving is forestalled by the parity problem ([17]), which Chowla’s conjecture may be said to embody in its pure form. We prove (1.1) for f irreducible of degree 3. In a companion paper [12], we prove (1.1) for f reducible of degree 3. In [12], we follow Chowla’s original formulation, using the Liouville function λ instead of μ in (1.1). For deg f = 3, the two formulations are equivalent: see §5.
منابع مشابه
The Parity Problem for Reducible Cubic Forms
This conjecture can be traced to Chowla ([2], p. 96); it is closely related to the Bunyakovsky/Schinzel conjecture on primes represented by irreducible polynomials. The one-variable analogue of (1.2) is classical for deg f = 1 and quite hopeless for deg f > 1. We know (1.2) itself when deg f ≤ 2. (The main ideas of the proof go back to de la Vallée-Poussin ([5], [6]); see [10], §3.3, for an exp...
متن کاملIrreducible pseudo 2-factor isomorphic cubic bipartite graphs
A bipartite graph is pseudo 2–factor isomorphic if all its 2–factors have the same parity of number of circuits. In a previous paper we have proved that pseudo 2–factor isomorphic k–regular bipartite graphs exist only for k ≤ 3, and partially characterized them. In particular we proved that the only essentially 4–edge-connected pseudo 2–factor isomorphic cubic bipartite graph of girth 4 is K3,3...
متن کاملKlein Forms and the Generalized Superelliptic Equation
If F (x, y) ∈ Z[x, y] is an irreducible binary form of degree k ≥ 3 then a theorem of Darmon and Granville implies that the generalized superelliptic equation F (x, y) = z has, given an integer l ≥ max{2, 7 − k}, at most finitely many solutions in coprime integers x, y and z. In this paper, for large classes of forms of degree k = 3, 4, 6 and 12 (including, heuristically, “most” cubic forms), w...
متن کاملOn the Representation of Unity by Binary Cubic Forms
If F (x, y) is a binary cubic form with integer coefficients such that F (x, 1) has at least two distinct complex roots, then the equation F (x, y) = 1 possesses at most ten solutions in integers x and y, nine if F has a nontrivial automorphism group. If, further, F (x, y) is reducible over Z[x, y], then this equation has at most 2 solutions, unless F (x, y) is equivalent under GL2(Z)action to ...
متن کاملCo-regular Spaces and Genus One Curves
Some examples of coregular spaces were mentioned last time binary quadratic forms, binary cubic forms etc. Clearly, any pre-homogeneous space is a vector space. Coregular spaces were first classified by Littelman (1989) for semisimple irreducible representations; there are around 50 of them including infinite families. A lot of these spaces come from Vinberg theory, something that’ll be discuss...
متن کامل